TSTP Solution File: SET592^5 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SET592^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 10:49:59 EDT 2024
% Result : Theorem 2.96s 1.68s
% Output : Refutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 60 ( 15 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 112 ( 23 ~; 9 |; 15 &; 53 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 18 ^ 28 !; 2 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a > $o ).
thf(sk4_type,type,
sk4: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) ) )
=> ( A
= ( ^ [D: a] : $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_51_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) ) )
=> ( A
= ( ^ [D: a] : $false ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) ) )
=> ( A
= ( ^ [D: a] : $false ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: a > $o] :
( ? [B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
& ? [C: a > $o] :
( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) ) ) )
=> ( A
= ( ^ [B: a] : $false ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(7,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(11,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(simp,[status(thm)],[7]) ).
thf(5,plain,
( sk1
!= ( ^ [A: a] : $false ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
( sk1
!= ( ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(12,plain,
sk1 @ sk4,
inference(func_ext,[status(esa)],[9]) ).
thf(8,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(6,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(cnf,[status(esa)],[4]) ).
thf(10,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(13,plain,
! [A: a] :
~ ( ( sk2 @ A )
& ( sk3 @ A ) ),
inference(func_ext,[status(esa)],[10]) ).
thf(14,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ~ ( sk3 @ A ) ),
inference(cnf,[status(esa)],[13]) ).
thf(17,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A )
| ~ ( sk3 @ B )
| ( ( sk2 @ A )
!= ( sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[8,14]) ).
thf(18,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ~ ( sk3 @ A ) ),
inference(pattern_uni,[status(thm)],[17:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(19,plain,
! [A: a] :
( ~ ( sk3 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[12,18]) ).
thf(20,plain,
~ ( sk3 @ sk4 ),
inference(pattern_uni,[status(thm)],[19:[bind(A,$thf( sk4 ))]]) ).
thf(26,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[11,20]) ).
thf(27,plain,
~ ( sk1 @ sk4 ),
inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( sk4 ))]]) ).
thf(33,plain,
~ $true,
inference(rewrite,[status(thm)],[27,12]) ).
thf(34,plain,
$false,
inference(simp,[status(thm)],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET592^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 6 20:40:09 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.97/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.97 % [INFO] Parsing done (112ms).
% 1.17/0.97 % [INFO] Running in sequential loop mode.
% 1.60/1.19 % [INFO] nitpick registered as external prover.
% 1.60/1.19 % [INFO] Scanning for conjecture ...
% 1.79/1.25 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.87/1.27 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.87/1.27 % [INFO] Problem is higher-order (TPTP THF).
% 1.87/1.27 % [INFO] Type checking passed.
% 1.87/1.28 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.60/1.63 % [INFO] Killing All external provers ...
% 2.96/1.68 % Time passed: 1150ms (effective reasoning time: 698ms)
% 2.96/1.68 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.96/1.68 % Axioms used in derivation (0):
% 2.96/1.68 % No. of inferences in proof: 22
% 2.96/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1150 ms resp. 698 ms w/o parsing
% 2.97/1.71 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.97/1.71 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------